منابع مشابه
Image Tag Completion by Noisy Matrix Recovery
It is now generally recognized that user-provided image tags are incomplete and noisy. In this study, we focus on the problem of tag completion that aims to simultaneously enrich the missing tags and remove noisy tags. The novel component of the proposed framework is a noisy matrix recovery algorithm. It assumes that the observed tags are independently sampled from an unknown tag matrix and our...
متن کاملLightweight Onboard Hyperspectral Compression and Recovery by Matrix Completion
While traditional hyperspectral imaging platforms rely on a time-consuming sequential scanning of a scene, novel snapshot approaches can acquire the full hyperspectral profile from a single exposure, employing cutting-edge technology such as Spectrally Resolvable Detector Arrays. However, faster scanning using snapshot systems comes with a price as the resulting spatial resolution is significan...
متن کاملWeighted Matrix Completion and Recovery with Prior Subspace Information
A low-rank matrix with “diffuse” entries can beefficiently reconstructed after observing a few of its entries,at random, and then solving a convex program. In manyapplications, in addition to these measurements, potentiallyvaluable prior knowledge about the column and row spaces ofthe matrix is also available to the practitioner. In this paper,we incorporate this prior k...
متن کاملRobust Photometric Stereo via Low-Rank Matrix Completion and Recovery
We present a new approach to robustly solve photometric stereo problems. We cast the problem of recovering surface normals from multiple lighting conditions as a problem of recovering a low-rank matrix with both missing entries and corrupted entries, which model all types of non-Lambertian effects such as shadows and specularities. Unlike previous approaches that use Least-Squares or heuristic ...
متن کاملFast Algorithm for Low-rank matrix recovery in Poisson noise
This paper describes a new algorithm for recovering low-rank matrices from their linear measurements contaminated with Poisson noise: the Poisson noise Maximum Likelihood Singular Value thresholding (PMLSV) algorithm. We propose a convex optimization formulation with a cost function consisting of the sum of a likelihood function and a regularization function which the nuclear norm of the matrix...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2016
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2015.2500192